Non-Preemptive Scheduling on Machines with Setup Times

Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n, m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.Comment: A conference version of this paper has been accepted for publication in the proceedings of the 14th Algorithms and Data Structures Symposium (WADS

Dynamic scheduling of aircraft landings

This paper considers the scheduling of aircraft landings on a single runway. There are time window constraints for each aircraft’s landing time, and minimum separation times between consecutive landings, where the separation times depend on the weight classes of the two landing aircraft. A multi-objective formulation takes account of runway throughput, earliness and lateness, and the cost of fuel arising from aircraft manoeuvres and additional flight time incurred to achieve the landing schedule. The paper investigates both the static/off-line problem where details of the arriving flights are known in advance, and the dynamic/on-line problem where flight arrival information becomes available over time. Under dynamic scheduling, the algorithm makes periodic updates to the previous schedule to take into account the aircraft that are newly available. We investigate dynamic programing and local search implementations for the static and dynamic problem using random test data and real data from London Heathrow airport

Scheduling Bidirectional Traffic on a Path

We study the fundamental problem of scheduling bidirectional traffic along a path composed of multiple segments. The main feature of the problem is that jobs traveling in the same direction can be scheduled in quick succession on a segment, while jobs in opposing directions cannot cross a segment at the same time. We show that this tradeoff makes the problem significantly harder than the related flow shop problem, by proving that it is NP-hard even for identical jobs. We complement this result with a PTAS for a single segment and non-identical jobs. If we allow some pairs of jobs traveling in different directions to cross a segment concurrently, the problem becomes APX-hard even on a single segment and with identical jobs. We give polynomial algorithms for the setting with restricted compatibilities between jobs on a single and any constant number of segments, respectively

A New Constructive Heuristic for the Fm|block|ST

This paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization of jobs. The heuristic has three-phases to build the sequence; the first phase selects the first job to be scheduled, the second phase arranges the remaining jobs and the third phase uses the insertion procedure of NEH to improve the sequence. The proposed procedures evaluate the tardiness associated to the sequence obtained before and after the third phase in order to keep the best of both because the insertion phase can worsen the result. The computational evaluation of these procedures against the benchmark constructive procedures from the literature reveals their good performance.Postprint (published version

Application of the PISA design model to monopiles embedded in layered soils

The PISA design model is a procedure for the analysis of monopile foundations for offshore wind turbine applications. This design model has been previously calibrated for homogeneous soils; this paper extends the modelling approach to the analysis of monopiles installed at sites where the soil profile is layered. The paper describes a computational study on monopiles embedded in layered soil configurations comprising selected combinations of soft and stiff clay and sand at a range of relative densities. The study comprises (a) analyses of monopile behaviour using detailed three-dimensional (3D) finite-element analysis, and (b) calculations employing the PISA design model. Results from the 3D analyses are used to explore the various influences that soil layering has on the performance of the monopile. The fidelity of the PISA design model is assessed by comparisons with data obtained from equivalent 3D finite-element analyses, demonstrating a good agreement in most cases. This comparative study demonstrates that the PISA design model can be applied successfully to layered soil configurations, except in certain cases involving combinations of very soft clay and very dense sand. </jats:p

PISA design methods for offshore wind turbine monopiles

Abstract This paper provides an overview of the PISA design model recently developed for laterally loaded offshore wind turbine monopiles through a major European joint-industry academic research project, the PISA Project. The focus was on large diameter, relatively rigid piles, with low length to diameter (L/D) ratios, embedded in clay soils of different strength characteristics, sand soils of different densities and in layered soils combining clays and sands. The resulting design model introduces new procedures for site specific calibration of soil reaction curves that can be applied within a one-dimensional (1D), Winkler-type, computational model. This paper summarises the results and key conclusions from PISA, including design methods for (a) stiff glacial clay till (Cowden till), (b) brittle stiff plastic clay (London clay), (c) soft clay (Bothkennar clay), (d) sand of varying densities (Dunkirk), and, (e) layered profiles (combining soils from (a) to (d)). The results indicate that the homogeneous soil reaction curves applied appropriately for layered profiles in the 1D PISA design model provide a very good fit to the three-dimensional finite element (3D FE) calculations, particularly for profiles relevant to current European offshore wind farm sites. Only a small number of cases, involving soft clay, very dense sand and L/D = 2 monopiles, would appear to require more detailed and bespoke analysis.</jats:p

PISA design model for monopiles for offshore wind turbines: Application to a marine sand

This paper describes a one-dimensional (1D) computational model for the analysis and design of laterally loaded monopile foundations for offshore wind turbine applications. The model represents the monopile as an embedded beam and specially formulated functions, referred to as soil reaction curves, are employed to represent the various components of soil reaction that are assumed to act on the pile. This design model was an outcome of a recently completed joint industry research project – known as PISA – on the development of new procedures for the design of monopile foundations for offshore wind applications. The overall framework of the model, and an application to a stiff glacial clay till soil, is described in a companion paper by Byrne and co-workers; the current paper describes an alternative formulation that has been developed for soil reaction curves that are applicable to monopiles installed at offshore homogeneous sand sites, for drained loading. The 1D model is calibrated using data from a set of three-dimensional finite-element analyses, conducted over a calibration space comprising pile geometries, loading configurations and soil relative densities that span typical design values. The performance of the model is demonstrated by the analysis of example design cases. The current form of the model is applicable to homogeneous soil and monotonic loading, although extensions to soil layering and cyclic loading are possible. </jats:p

Ecosystem restoration strengthens pollination network resilience and function.

Land degradation results in declining biodiversity and the disruption of ecosystem functioning worldwide, particularly in the tropics. Vegetation restoration is a common tool used to mitigate these impacts and increasingly aims to restore ecosystem functions rather than species diversity. However, evidence from community experiments on the effect of restoration practices on ecosystem functions is scarce. Pollination is an important ecosystem function and the global decline in pollinators attenuates the resistance of natural areas and agro-environments to disturbances. Thus, the ability of pollination functions to resist or recover from disturbance (that is, the functional resilience) may be critical for ensuring a successful restoration process. Here we report the use of a community field experiment to investigate the effects of vegetation restoration, specifically the removal of exotic shrubs, on pollination. We analyse 64 plant-pollinator networks and the reproductive performance of the ten most abundant plant species across four restored and four unrestored, disturbed mountaintop communities. Ecosystem restoration resulted in a marked increase in pollinator species, visits to flowers and interaction diversity. Interactions in restored networks were more generalized than in unrestored networks, indicating a higher functional redundancy in restored communities. Shifts in interaction patterns had direct and positive effects on pollination, especially on the relative and total fruit production of native plants. Pollinator limitation was prevalent at unrestored sites only, where the proportion of flowers producing fruit increased with pollinator visitation, approaching the higher levels seen in restored plant communities. Our results show that vegetation restoration can improve pollination, suggesting that the degradation of ecosystem functions is at least partially reversible. The degree of recovery may depend on the state of degradation before restoration intervention and the proximity to pollinator source populations in the surrounding landscape. We demonstrate that network structure is a suitable indicator for pollination quality, highlighting the usefulness of interaction networks in environmental management

Longest Increasing Subsequence under Persistent Comparison Errors

We study the problem of computing a longest increasing subsequence in a sequence $S$ of $n$ distinct elements in the presence of persistent comparison errors. In this model, every comparison between two elements can return the wrong result with some fixed (small) probability $p$, and comparisons cannot be repeated. Computing the longest increasing subsequence exactly is impossible in this model, therefore, the objective is to identify a subsequence that (i) is indeed increasing and (ii) has a length that approximates the length of the longest increasing subsequence. We present asymptotically tight upper and lower bounds on both the approximation factor and the running time. In particular, we present an algorithm that computes an $O(\log n)$-approximation in time $O(n\log n)$, with high probability. This approximation relies on the fact that that we can approximately sort $n$ elements in $O(n\log n)$ time such that the maximum dislocation of an element is at most $O(\log n)$. For the lower bounds, we prove that (i) there is a set of sequences, such that on a sequence picked randomly from this set every algorithm must return an $\Omega(\log n)$-approximation with high probability, and (ii) any $O(\log n)$-approximation algorithm for longest increasing subsequence requires $\Omega(n \log n)$ comparisons, even in the absence of errors

Impacts of selected Ecological Focus Area options in European farmed landscapes on climate regulation and pollination services: a systematic map protocol

Background: This systematic map protocol responds to an urgent policy need to evaluate key environmental benefits of new compulsory greening measures in the European Union’s Common Agricultural Policy (CAP), with the aim of building a policy better linked to environmental performance. The systematic map will focus on Ecological Focus Areas (EFAs), in which larger arable farmers must dedicate 5% of their arable land to ecologically beneficial habitats, landscape features and land uses. The European Commission’s Joint Research Centre has used a software tool called the ‘EFA calculator’ to inform the European Commission about environmental benefits of EFA implementation. However, there are gaps in the EFA calculator’s coverage of ecosystem services, especially ‘global climate regulation’, and an opportunity to use systematic mapping methods to enhance its capture of evidence, in advance of forthcoming CAP reforms. We describe a method for assembling a database of relevant, peer-reviewed research conducted in all agricultural landscapes in Europe and neighbouring countries with similar biogeography, addressing the primary question: what are the impacts of selected EFA features in agricultural land on two policy-relevant ecosystem service outcomes—global climate regulation and pollination? The method is streamlined to allow results in good time for the current, time-limited opportunity to influence reforms of the CAP greening measures at European and Member State level. Methods: We will search four bibliographic databases in English, using a predefined and tested search string that focuses on a subset of EFA options and ecosystem service outcomes. The options and outcomes are selected as those with particular policy relevance and traction. Only articles in English will be included. We will screen search results at title, abstract and full text levels, recording the number of studies deemed non-relevant (with reasons at full text). A systematic map database that displays the meta-data (i.e. descriptive summary information about settings and methods) of relevant studies will be produced following full text assessment. The systematic map database will be published as a MS-Excel database. The nature and extent of the evidence base will be discussed, and the applicability of methods to convert the available evidence into EFA calculator scores will be assessed